Heuristic Search for Non-Bottom-Up Tree Structure Prediction
نویسندگان
چکیده
●Use beam search and Dynamic Programming techniques. Bottom-up Approximation State of the art Tree Structures Prediction techniques rely on bottom-up decoding. These approaches allow the use of context-free features and a bottom-up approximation of contextual features. With this paper we: ●Discuss the limitations of mainstream techniques in solving common Natural Language Processing tasks ●Devise a new undirected framework that allows a better integration of contextual features. ●Design a new system that addresses these issues ●Run experiments on Hierarchical Machine Translation. Andrea Gesmundo James Henderson
منابع مشابه
A general heuristic bottom-up procedure for searching and/or graphs
This paper presents a general heuristic bottom-up procedure for finding a least-cost solution tree of an AND/OR graph when the cost functions associated with the arcs are monotone. Since monotone cost functions are very general, the procedure is applicable to a very large number of problems. The procedure works for both cyclic and acyclic AND/OR graphs, and subsumes most of the known bottom-up ...
متن کاملEfficient Methods for Pseudo-tree Based Distributed Best First Search
Abstract— Distributed constraint optimization problem is an area of research in multi agent system. In recent years, a distributed constraint optimization algorithm, which performs best-first search in bottom up manner according to pseudo tree, was proposed. In this paper, we propose several efficient methods for the distributed bottom up best-first search. Derivation of partial solution is int...
متن کاملImprovement of efficiency in pseudo-tree based distributed best first search
Abstract— Distributed constraint optimization problem is an area of research in multi agent system. In recent years, a distributed constraint optimization algorithm, which performs best-first search in bottom up manner according to pseudo tree, was proposed. In this paper, we propose several efficient methods for the distributed bottom up best-first search. Derivation of partial solution is int...
متن کاملAn Effective Framework for Chinese Syntactic Parsing
This paper presents an effective framework for Chinese syntactic parsing, which includes two parts. The first one is a parsing framework, which is based on an improved bottom-up chart parsing algorithm, and integrates the idea of the beam search strategy of N best algorithm and heuristic function of A* algorithm for pruning, then get multiple parsing trees. The second is a novel evaluation mode...
متن کاملControlled Conspiracy-Number Search
In this paper we present a new conspiracy number search algorithm (CNS), called Controlled Conspiracy Number Search (CCNS). The basic steps of any CNS algorithm, the selection, the expansion, and the backup of results have been modiied compared to other CNS algorithms. The selection is done by assigning demands, so called CN targets, to the nodes of the tree in a top-down fashion. By this, a se...
متن کامل